Depth-first search - PDFSEARCH.IO - Document Search Engine

Depth-first search
Results: 101

#	Item
51	Influential Community Search in Large Networks Rong-Hua Li† , Lu Qin‡ , Jeffrey Xu Yu∗ , and Rui Mao† † Guangdong Province Key Laboratory of Popular High Performance Computers, Shenzhen University, China ‡ Add to Reading List Source URL: www.vldb.org Language: English - Date: 2014-12-17 10:03:05 Search algorithms Degeneracy Tree Connectivity Depth-first search Degree NP-complete problems Spanning tree Graph coloring Graph theory Mathematics Theoretical computer science
52	Artificial Intelligence : Strategies, Applications, and Models Through SEARCH Add to Reading List Source URL: cdn.preterhuman.net Language: English - Date: 2012-10-01 15:33:06 Computing Prolog Heuristic Iterative deepening depth-first search Parsing Algorithm Depth-first search A* search algorithm Breadth-first search Search algorithms Mathematics Artificial intelligence
53	Fringe Search: Beating A* at Pathfinding on Game Maps Yngvi Bj¨ornsson School of Computer Science Reykjavik University Reykjavik, Iceland IS-103 [removed] Add to Reading List Source URL: cswww.essex.ac.uk Language: English - Date: 2005-07-01 06:17:56 Game artificial intelligence Graph theory Routing algorithms Combinatorial optimization Fringe search Binary trees A* search algorithm Iterative deepening depth-first search Heuristic function Search algorithms Artificial intelligence Mathematics
54	Principles of Artificial Intelligence Fall 2005 Handout #2 Goal-Based Agents Vasant Honavar Artificial Intelligence Research Laboratory Add to Reading List Source URL: www.cs.iastate.edu Language: English - Date: 2009-08-25 18:32:20 Artificial intelligence Breadth-first search A* search algorithm Depth-first search Iterative deepening depth-first search Heuristic function Shortest path problem Uniform-cost search IDA* Search algorithms Mathematics Graph theory
55	Symbiosis of Search and Heuristics for Random 3-SAT Sid Mijnders, Boris de Wilde, and Marijn J. H. Heule ! Delft University of Technology, Delft, The Netherlands Abstract. When combined properly, search techniques can re Add to Reading List Source URL: www.st.ewi.tudelft.nl Language: English - Date: 2010-11-29 08:06:00 Graph theory Binary trees Heuristic function Heuristics Heuristic Boolean satisfiability problem Depth-first search Binary search tree Tree traversal Theoretical computer science Mathematics Search algorithms
56	Details on discrimination algorithm for IUPAC model Geir Kjetil Sandve, Osman Abul, Vegard Walseng and Finn Drabløs The search space of IUPAC motifs is explored depth-first in a (implicit) search tree where each level o Add to Reading List Source URL: www.ncbi.nlm.nih.gov Language: English Computational complexity theory Algorithm Mathematical logic Reduction P String Theoretical computer science Applied mathematics Mathematics
57	Using Prior Knowledge with Adaptive Probing Add to Reading List Source URL: www.aaai.org Language: English - Date: 2006-01-11 03:45:13 Applied mathematics Heuristic function A* search algorithm Genetic algorithm Greedy algorithm Heuristic Depth-first search Reinforcement learning Algorithm Search algorithms Mathematics Artificial intelligence
58	A Computational Study of the Kemeny Rule for Preference Aggregation Add to Reading List Source URL: www.aaai.org Language: English - Date: 2006-01-11 00:46:34 Single winner electoral systems Combinatorial optimization Routing algorithms Condorcet method Depth-first search Voting system Graph Directed acyclic graph A* search algorithm Graph theory Mathematics Search algorithms
59	Best-First Fixed-Depth Minimax Algorithms Aske Plaat, Erasmus University, [removed] Jonathan Schaeffer, University of Alberta, [removed] Wim Pijls, Erasmus University, [removed] Ari Add to Reading List Source URL: wiki.cs.pdx.edu Language: English - Date: 2009-03-28 16:22:33 Mathematics Information science Negascout Alpha-beta pruning SSS* Minimax Transposition table B-tree Game tree Search algorithms Game artificial intelligence Artificial intelligence
60	Space-efficient and exact de Bruijn graph representation based on a Bloom filter Rayan Chikhi1 and Guillaume Rizk2 1 Computer Science department, ENS Cachan/IRISA, 35042 Rennes, France Add to Reading List Source URL: minia.genouest.org Language: English - Date: 2012-10-09 11:54:51 Bit array Connectivity De Bruijn graph Depth-first search De Bruijn Velvet assembler Koorde Graph theory Hashing Bloom filter